#pragma once
#include"HashTable.h"
template<class K,class Hash= HashFunc<K>>
class set
{
	struct SetKeyOfT
	{
		const K& operator()(const K& key)
		{
			return key
		}
	};
public:
	typedef typename HashTable<K, const K, SetKeyOfT, Hash>::Iterator iterator;
	typedef typename HashTable<K, const K, SetKeyOfT, Hash>::ConstIterator const_iterator;

	iterator begin()
	{
		return _ht.Begin();
	}

	iterator end()
	{
		return _ht.End();
	}

	const_iterator begin() const
	{
		return _ht.Begin();
	}

	const_iterator end() const
	{
		return _ht.End();
	}

	pair<iterator, bool> insert(const K& key)
	{
		return _ht.Insert(key);
	}

	iterator Find(const K& key)
	{
		return _ht.Find(key);
	}

	bool Erase(const K& key)
	{
		return _ht.Erase(key);
	}
private:
	HashNode<K,const K, SetKeyOfT, Hash> _ht;
};